Formulas Among Diagonals in the Regular Polygon and the Catalan Numbers

نویسندگان

  • Matthew Hudelson
  • M. Hudelson
چکیده

We look at relationships among the lengths of diagonals in the regular polygon. Specifically, we derive formulas for all diagonals in terms of the shortest diagonals and other formulas in terms of the next-to-shortest diagonals, assuming unit side length. These formulas are independent of the number of sides of the regular polygon. We also show that the formulas in terms of the shortest diagonals involve the famous Catalan numbers. 1. Motivation In [1], Fontaine and Hurley develop formulas that relate the diagonal lengths of a regular n-gon. Specifically, given a regular convex n-gon whose vertices are P0, P1, . . . , Pn−1, define dk as the distance between P0 and Pk. Then the law of sines yields dk dj = sin kπ n sin jπ n . Defining rk = sin kπ n sin πn , the formulas given in [1] are rhrk = min{k,h,n−k,n−h} ∑ i=1 r|k−h|+2i−1 and 1 rk = s ∑ j=1 rk(2j−1) where s = min{j > 0 : jk ≡ ±1 mod n}. Notice that for 1 ≤ k ≤ n − 1, rk = dk d1 , but there is no a priori restriction on k in the definition of rk. Thus, it would make perfect sense to consider r0 = 0 and r−k = −rk not to mention rk for non-integer values of k as well. Also, the only restriction on n in the definition of rn is that n not be zero or the reciprocal of an integer. Publication Date: October 23, 2006. Communicating Editor: Paul Yiu.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatoric Results for Graphical Enumeration and the Higher Catalan Numbers

We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared recently as an auxiliary function in enumerating maps and explicit computations of the asymptotic expansion of the partition function of random matrices in the u...

متن کامل

Polygon Dissections and Euler, Fuss, Kirkman, and Cayley Numbers

We give a short and elementary proof of the formulas for classical numbers of polygon dissections. We describe the relationship between the proof, our recent work in knot theory, and Jones’ work on planar algebras. Over one hundred years ago Arthur Cayley considered the following problem: “ The partitions are made by non-intersecting diagonals; the problem which have been successively considere...

متن کامل

Multivariate Fuss-Catalan numbers

are integers that appear in many combinatorial problems. These numbers first arose in the work of Catalan as the number of triangulations of a polygon by mean of nonintersecting diagonals. Stanley [13, 14] maintains a dynamic list of exercises related to Catalan numbers, including (at this date) 127 combinatorial interpretations. Closely related to Catalan numbers are ballot numbers. Their name...

متن کامل

Polygon Dissections and Standard Young Tableaux

A simple bijection is given between dissections of a convex n gon with d diagonals not intersecting in their interiors and standard Young tableaux of shape d d n d Partially supported by National Science Foundation grant DMS For d n let f n d be the number of ways to draw d diagonals in a convex n gon such that no two diagonals intersect in their interior For instance f n n is just the Catalan ...

متن کامل

Counting with Irrational Tiles

We introduce and study the number of tilings of unit height rectangles with irrational tiles. We prove that the class of sequences of these numbers coincides with the class of diagonals of N-rational generating functions and a class of certain binomial multisums. We then give asymptotic applications and establish connections to hypergeometric functions and Catalan numbers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006